Perfect Phylogeny

Perfect phylogeny is a term used in computational phylogenetics to denote a phylogenetic tree in which all internal nodes may be labeled such that all characters evolve down the tree without homoplasy. That is, characteristics do not hold to convergent evolution, evolutionary convergence, and do not have analogous structures. Statistically, this can be represented as an ancestor having state "0" in all characteristics where 0 represents a lack of that characteristic. Each of these characteristics changes from 0 to 1 exactly once and never reverts to state 0. It is rare that actual data adheres to the concept of perfect phylogeny.

Building

In general there are two different data types that are used in the construction of a phylogenetic tree. In distance-based computations a phylogenetic tree is created by analyzing relationships among the distance between species and the edge lengths of a corresponding tree. Using a character-based approach employs character states across species as an input in an attempt to find the most "perfect" phylogenetic tree.

The statistical components of a perfect phylogenetic tree can best be described as follows:

A perfect phylogeny for an ''n'' x ''m'' character state matrix ''M'' is a rooted tree ''T'' with ''n'' leaves satisfying:


i. Each row of ''M'' labels exactly one leaf of ''T''


ii. Each column of ''M'' labels exactly one edge of ''T''


iii. Every interior edge of ''T'' is labeled by at least one column of ''M''


iv. The characters associated with the edges along the unique path from root to a leaf ''v'' exactly specify the character vector of ''v'', i.e. the character vector has a 1 entry in all columns corresponding to characters associated to path edges and a 0 entry otherwise.

It is worth noting that it is very rare to find actual phylogenetic data that adheres to the concepts and limitations detailed here. Therefore, it is often the case that researchers are forced to compromise by developing trees that simply try to minimize homoplasy, finding a maximum-cardinality set of compatible characters, or constructing phylogenies that match as closely as possible to the partitions implied by the characters.

Example

Both of these data sets illustrate examples of character state matrices. Using matrix M'₁ one is able to observe that the resulting phylogenetic tree can be created such that each of the characters label exactly one edge of the tree. In contrast, when observing matrix M'₂, one can see that there is no way to set up the phylogenetic tree such that each character labels only one edge length. If the samples come from variant allelic frequency (VAF) data of a population of cells under study, the entries in the character matrix are frequencies of mutations, and take a value between 0 and 1. Namely, if $c_i$ represents a position in the genome, then the entry corresponding to $c_i$ and sample $s_j$ will hold the frequencies of genomes in sample $s_j$ with a mutation in position $c_i$.

File:PerfectPhylogenyExample.jpg, An example of a character matrix that can be depicted as a perfect phylogeny

Usage

Perfect phylogeny is a theoretical framework that can also be used in more practical methods. One such example is that of Incomplete Directed Perfect Phylogeny. This concept involves utilizing perfect phylogenies with real, and therefore incomplete and imperfect, datasets. Such a method utilizes SINEs to determine evolutionary similarity. These Short Interspersed Elements are present across many genomes and can be identified by their flanking sequences. SINEs provide information on the inheritance of certain traits across different species. Unfortunately, if a SINE is missing it is difficult to know whether those SINEs were present prior to the deletion. By utilizing algorithms derived from perfect phylogeny data we are able to attempt to reconstruct a phylogenetic tree in spite of these limitations.

Perfect phylogeny is also used in the construction of haplotype maps. By utilizing the concepts and algorithms described in perfect phylogeny one can determine information regarding missing and unavailable haplotype data. By assuming that the set of haplotypes that result from genotype mapping corresponds and adheres to the concept of perfect phylogeny (as well as other assumptions such as perfect Mendelian inheritance and the fact that there is only one mutation per SNP), one is able to infer missing haplotype data.

Inferring a phylogeny from noisy VAF data under the PPM is a hard problem. Most inference tools include some heuristic step to make inference computationally tractable. Examples of tools that infer phylogenies from noisy VAF data include AncesTree, Canopy, CITUP, EXACT, and PhyloWGS. In particular, EXACT performs exact inference by using GPUs to compute a posterior probability on all possible trees for small size problems. Extensions to the PPM have been made with accompanying tools. For example, tools such as MEDICC, TuMult, and FISHtrees allow the number of copies of a given genetic element, or ploidy, to both increase, or decrease, thus effectively allowing the removal of mutations.

External links

* List of phylogenetics software
One of several programs available for analysis and creation of phylogenetic trees

Another such program for phylogenetic tree analysis

Additional program for tree analysis

A paper detailing an example of how perfect phylogeny can be utilized outside of the field of genetics, as in language associationGithub for "Algorithm for clonal tree reconstruction from multi-sample cancer sequencing data" (AncesTree)Github for "Accessing Intra-Tumor Heterogeneity and Tracking Longitudinal and Spatial Clonal Evolutionary History by Next-Generation Sequencing" (Canopy)Github for "Clonality Inference in Tumors Using Phylogeny" (CITUP)Github for "Exact inference under the perfect phylogeny model" (EXACT)Github for "Reconstructing subclonal composition and evolution from whole-genome sequencing of tumors" (PhyloWGS)
*

References

{{Reflist

Computational phylogenetics